Convex Cost Multicommodity Flow Problems: Applications and Algorithms
نویسنده
چکیده
We review and analyze nonlinear programming approaches to modeling and solving certain flow problems in telecommunications, transportation and supply chain management. We emphasize the common aspects of telecommunications and road networks, and indicate the importance of game theoretic and equilibrium approaches. Algorithms based on the Frank-Wolfe method are developed in depth and their implementations on sequential and parallel machines are discussed and evaluated for large-scale real-world networks. Several research directions are also stated.
منابع مشابه
Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
We consider here a multicommodity flow network optimization problem with nonconvex but piecewise convex arc cost functions. We derive complete optimality conditions for local minima based on negative-cost cycles associated with each commodity. These conditions do not extend to the convex non-smooth case.
متن کاملOptimal multicommodity flows in dynamic networks and algorithms for their finding
In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that cost functions, defined on edges, are nonlinear and depending on time and flow, and the demand function ...
متن کاملFaster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min...
متن کاملA Survey of Algorithms for Convex Multicommodity Flow Problems
There are many problems related to the design of networks. Among them, the message routing problem plays a determinant role in the optimization of network performance. Much of the motivation for this work comes from this problem which is shown to belong to the class of nonlinear convex multicommodity ow problems. This paper emphasizes the message routing problem in data networks, but it include...
متن کاملLp Relaxations Better than Convexification for Multicommodity Network Optimization Problems with Step Increasing Cost Functions
We address here a class of particularly hard-to-solve combinatorial optimization problems namely multicommodity network optimization when the link cost functions are discontinuous step increasing. The main focus is on the development of relaxations for such problems in order to derive lower bounds. A straightforward way of getting lower bounds is to solve the “convexification” of the problem, i...
متن کامل